Polish intellectual historian Leszek Kołakowski proposed in the 1960s an innovative, now virtually forgotten, reimagining of a crucial concept in the history of Roman Catholicism: the idea of "Counter-Reformation." Kołakowski's lifelong affinity for early modern Europe's Catholic dissidents led him into dialogue in the era of Vatican II with Tadeusz Mazowiecki, the leader of a movement of young Polish reformers who styled themselves "Catholic socialists." Seeing them as the bedrock of a new Catholic Counter-Reformation, Kołakowski sketched the role he hoped (...) Poland might play in reinventing not only Catholicism, but religious life in the modern world. (shrink)

People can support abstract reasoning by using mental models with spatial simulations. Such models are employed when people represent elements in terms of ordered dimensions (e.g. who is oldest, Tom, Dick, or Harry). We test and find that the process of forming and using such mental models can influence the liking of its elements (e.g. Tom, Dick, or Harry). The presumed internal structure of such models (linear-transitive array of elements), generates variations in processing ease (fluency) when using the model in (...) working memory (see the Symbolic Distance Effect, SDE). Specifically, processing of pairs where elements have larger distances along the order should be easier compared to pairs with smaller distances. Elements from easier pairs should be liked more than elements from difficult pairs (fluency being hedonically positive). Experiment 1 shows that unfamiliar ideographs are liked more when at wider distances and therefore easier to process. Experiment 2 replicates this effect with non-words. Experiment 3 rules out a non-spatial explanation of the effect while Experiments 4 offers a high-powered replication. Experiment 5 shows that the spatial effect spontaneously emerges after learning, even without a task that explicitly focuses on fluency. Experiment 6 employed a shorter array, but yielded no significant results. (shrink)

I argue here that consciousness can be engineered. The claim that functional consciousness can be engineered has been persuasively put forth in regards to first-person functional consciousness; robots, for instance, can recognize colors, though there is still much debate about details of this sort of consciousness. Such consciousness has now become one of the meanings of the term phenomenal consciousness (e.g., as used by Franklin and Baars). Yet, we extend the argument beyond the tradition of behaviorist or functional reductive views (...) on consciousness that still predominate within cognitive science. If Nagel-Chalmers-Block-style non-reductive naturalism about first-person consciousness (h-consciousness) holds true, then, eventually we should be able to understand how such consciousness operates and how it gets produced (this is not the same as bridging the explanatory gap or solving Chalmers’s hard problem of consciousness). If so, the consciousness it involves can in principle be engineered. (shrink)

An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.

There is relatively little literature on Indian skepticism, with hardly any monograph on the subject comparable to, e.g., Julia Annas’ and Jonathan Barnes’ The Modes of Scepticism: Ancient Texts and Modern Interpretations, R.J. Hankinson’s The Sceptics: The Arguments of the Philosophers, a series of Richard H. Popkin’s monographs on the history of skepticism, or two recent competing volumes as collective efforts: The Oxford Handbook of Skepticism edited by John Greco and The Cambridge Companion to Ancient Scepticism edited by Richard Bett. (...) Therefore what promises to provide a survey of the skeptical tradition of South Asia should potentially be regarded as a milestone work in the... (shrink)

The principles of the physical patterns of self-organization are numerous, different upon various levels of the scale of complexity. The integrated pattern of the changes going on in a living body indicates an integrated nature of its principle - whatever it might happen to be. Aristotle called this kind of principle „psycho", H. Driesch called it „entelecheia", sociobiolo- gists believe that D N A is the right name for it. The fundamental problem consists in seeing - not just deciding a (...) priori - if the empirical data do require - in a living organism - a single, integrating agency. If such a requirement originates in an illusion, the whole problem is fictitious. If this requirement is well founded, then we must to search for such an agent. (shrink)

The principles of the physical patterns of self-organization are numerous, different upon various levels of the scale of complexity. The integrated pattern of the changes going on in a living body indicates an integrated nature of its principle - whatever it might happen to be. Aristotle called this kind of principle „psycho", H. Driesch called it „entelecheia", sociobiolo- gists believe that D N A is the right name for it. The fundamental problem consists in seeing - not just deciding a (...) priori - if the empirical data do require - in a living organism - a single, integrating agency. If such a requirement originates in an illusion, the whole problem is fictitious. If this requirement is well founded, then we must to search for such an agent. (shrink)

The principles of the physical patterns of self-organization are numerous, different upon various levels of the scale of complexity. The integrated pattern of the changes going on in a living body indicates an integrated nature of its principle - whatever it might happen to be. Aristotle called this kind of principle „psycho", H. Driesch called it „entelecheia", sociobiolo- gists believe that D N A is the right name for it. The fundamental problem consists in seeing - not just deciding a (...) priori - if the empirical data do require - in a living organism - a single, integrating agency. If such a requirement originates in an illusion, the whole problem is fictitious. If this requirement is well founded, then we must to search for such an agent. (shrink)

In the article, the author tries to present what the specificity of the issue should consist of – the One and the Many in the aspect of the philosophy of art. For this purpose, he refers to the thought of H-G. Gadamer and Th. W. Adorno, showing the specificity of the existence of artistic objects and the necessity of the emergence of separate interpretations inscribed in it, which, however, have their source in the possibilitiesoffered by a work of art, and (...) are not an external application of content, with a completely separate specificity of existence. When adapting philosophical content, he tries not to forget about the exemplification coming straight from the world of art. (shrink)

For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow and Fremlin’s result stating (...) that there are Efimov spaces in the random model. We also investigate relations between topologies on$\mathcal {H}(\mathbb {A},\mathbb {B})$for a Boolean algebra$\mathbb {B}$carrying a strictly positive measure and convergence properties of sequences of measures on$\mathbb {A}$. (shrink)

An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determine exactly how hard it is to enumerate the Kolmogorov function, which (...) assigns to each string x its Kolmogorov complexity: • For every underlying universal machine U, there is a constant a such that C is k(n)-enumerable only if k(n) ≥ n/a for almost all n. • For any given constant k, the Kolmogorov function is k-enumerable relative to an oracle A if and only if A is at least as hard as the halting problem. • There exists an r.e., Turing-incomplete set A such for every non-decreasing and unbounded recursive function k, the Kolmogorov function is k(n)-enumerable relative to A. The last result is obtained by using a relativizable construction for a nonrecursive set A relative to which the prefix-free Kolmogorov complexity differs only by a constant from the unrelativized prefix-free Kolmogorov complexity. Although every 2-enumerator for C is Turing hard for K, we show that reductions must depend on the specific choice of the 2-enumerator and there is no bound on the quantity of their queries. We show our negative results even for strong 2-enumerators as an oracle where the querying machine for any x gets directly an explicit list of all hypotheses of the enumerator for this input. The limitations are very general and we show them for any recursively bounded function g: • For every Turing reduction M and every non-recursive set B, there is a strong 2-enumerator f for g such that M does not Turing reduce B to f. • For every non-recursive set B, there is a strong 2-enumerator f for g such that B is not wtt-reducible to f. Furthermore, we deal with the resource-bounded case and give characterizations for the class ${\rm S}_{2}^{{\rm P}}$ introduced by Canetti and independently Russell and Sundaram and the classes PSPACE, EXP. • ${\rm S}_{2}^{{\rm P}}$ is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time tt-reduction which reduces A to every strong 2-enumerator for g. • PSPACE is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time Turing reduction which reduces A to every strong 2-enumerator for g. Interestingly, g can be taken to be the Kolmogorov function for the conditional space bounded Kolmogorov complexity. • EXP is the class of all sets A for which there is a polynomially bounded function g and a machine M which witnesses A ∈ PSPACEf for all strong 2-enumerators f for g. Finally, we show that any strong O(log n)-enumerator for the conditional space bounded Kolmogorov function must be PSPACE-hard if P = NP. (shrink)

In their joint paper entitled The Replication of the Hard Problem of Consciousness in AI and BIO-AI (Boltuc et al. Replication of the hard problem of conscious in AI and Bio- AI: An early conceptual framework 2008), Nicholas and Piotr Boltuc suggest that machines could be equipped with phenomenal consciousness, which is subjective consciousness that satisfies Chalmer’s hard problem (We will abbreviate the hard problem of consciousness as H-consciousness ). The claim is that if we knew the inner workings (...) of phenomenal consciousness and could understand its’ precise operation, we could instantiate such consciousness in a machine. This claim, called the extra-strong AI thesis, is an important claim because if true it would demystify the privileged access problem of first-person consciousness and cast it as an empirical problem of science and not a fundamental question of philosophy. A core assumption of the extra-strong AI thesis is that there is no logical argument that precludes the implementation of H-consciousness in an organic or in-organic machine provided we understand its algorithm. Another way of framing this conclusion is that there is nothing special about H-consciousness as compared to any other process. That is, in the same way that we do not preclude a machine from implementing photosynthesis, we also do not preclude a machine from implementing H-consciousness. While one may be more difficult in practice, it is a problem of science and engineering, and no longer a philosophical question. I propose that Boltuc’s conclusion, while plausible and convincing, comes at a very high price; the argument given for his conclusion does not exclude any conceivable process from machine implementation. In short, if we make some assumptions about the equivalence of a rough notion of algorithm and then tie this to human understanding, all logical preconditions vanish and the argument grants that any process can be implemented in a machine. The purpose of this paper is to comment on the argument for his conclusion and offer additional properties of H-consciousness that can be used to make the conclusion falsifiable through scientific investigation rather than relying on the limits of human understanding. (shrink)

Leading authors in their fields present an interdisciplinary panorama of vital themes of the philosophy of language and track their historical origins. This book gives new life to historical ideas and additional depth to current debates.

In its attempt to come to grips with the nature of the human mind idealism employs such terms as "pure self," "transcendental apperception," "pure con sciousness" and so on.

This article aims to read feminist new materialisms (Barad), together with ‘postulated’ linguistic or cultural primacy of Queer Theory (Butler), to show how both are engaged in similar critical-ethical endeavours. The central argument is that the criticism of Barad and new materialisms misses Butler’s materialistic insights due to a narrow interpretation of Butler's alleged social-constructivist position. There is, therefore, a specific focus on where they both make similar ethical appeals. Moreover, the article relies on Adorno's negative dialectic to highlight an (...) interpretation of Barad and Butler as being part of the same dialectical movement, in which materialism and idealism fluctuate in their mutual criticisms, thus continuing the procession towards 'new knowledge' and emancipation, or freedom, through their motions back and forth. (shrink)

Predictive processing (PP) has been repeatedly presented as a unificatory account of perception, action, and cognition. In this paper, we argue that this is premature: As a unifying theory, PP fails to deliver general, simple, homogeneous, and systematic explanations. By examining its current trajectory of development, we conclude that PP remains only loosely connected both to its computational framework and to its hypothetical biological underpinnings, which makes its fundamentals unclear. Instead of offering explanations that refer to the same set of (...) principles, we observe systematic equivocations in PP‐based models, or outright contradictions with its avowed principles. To make matters worse, PP‐based models are seldom empirically validated, and they are frequently offered as mere just‐so stories. The large number of PP‐based models is thus not evidence of theoretical progress in unifying perception, action, and cognition. On the contrary, we maintain that the gap between theory and its biological and computational bases contributes to the arrested development of PP as a unificatory theory. Thus, we urge the defenders of PP to focus on its critical problems instead of offering mere re‐descriptions of known phenomena, and to validate their models against possible alternative explanations that stem from different theoretical assumptions. Otherwise, PP will ultimately fail as a unified theory of cognition. (shrink)

This is a study of the nature of time. In it, redeploying an argument first presented by McTaggart, the author argues that although time itself is real, tense is not. He accounts for the appearance of the reality of tense - our sense of the passage of time, and the fact that our experience occurs in the present - by showing how time is indispensable as a condition of action. Time itself is further analysed, and Dr Mellor gives answers to (...) most of the metaphysical questions it provokes, concerning the relation of time to space, the dissection of time, and its relation to change and causation. (shrink)

"First published by Oxford University Press, 1916."--Title page verso.

Public opinion has it that ethics should be concerned with studying and providing precise and reliable rules of conduct. This view is based in a long philosophical tradition which begins with the Stoics and continues at least to Kant; it is, however, a false view. There are good reasons to turn our attention to these aspects of moral thinking which refer to and emphasize the element of risk and uncertainty. In the article I briefly discuss two of such reasons: the (...) problem of moral luck and the problem of action based on ignorance. Consideration of these two problems leads to the conclusion that the most tricky element in moral thinking is the firm belief of the subject in the truth of the premises on which they base their actions and in the irrelevance of external factors to the assessment of their deeds. In this light I argue that the basic requirement for a moral justification of a particular action is not its conformity to a certain set of rules but the subject’s critical reflection on their course of action. Indeed, what turns an attitude into a moral attitude is an amoral, epistemological factor: criticism and openness to uncertainty. (shrink)

The article focuses on the anti-naturalism of Menger and Mises. It presents a methodological approach formulated by both scholars as stemming from epistemological anti-naturalism and demonstrating similarities to social phenomenology. The article also discusses the development of the anti-naturalistic perspective on the basis of Hayek’s conception of sensory order. The latter allowed addressing the problem of validity of methodological dualism and established a sound foundation for the methodological approach of the Austrian School of Economics.